A Deterministic Subexponential Algorithm for Solving Parity Games
نویسندگان
چکیده
منابع مشابه
A Discrete Subexponential Algorithm for Parity Games
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly
متن کاملA Randomized Subexponential Algorithm for Parity Games
We describe a randomized algorithm for Parity Games (equivalent to the Mu-Calculus Model Checking), which runs in expected time 2 O(k 1=(1+2")) when k is (n 1=2+"), n is the number of vertices, and 0 < " 1=2. That is, our algorithm is subexponential in the number of colors k of the game graph provided that k is not too small. All previously known algorithms were exponential in the number of col...
متن کاملNew Deterministic Algorithms for Solving Parity Games
We study parity games in which one of the two players controls only a small number k of nodes and the other player controls the n − k other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time k √ k) · O(n), and general parity games in time (p+ k) √ k) ·O(pnm), where p is the number of distinct priorities and m is the number of edges. For ...
متن کاملStrategy Iteration using Non-Deterministic Strategies for Solving Parity Games
This article introduces the idea of non-deterministic strategies for parity games: In a non-deterministic strategy a player restricts himself to some nonempty subset of possible actions at a given node, instead of limiting himself to exactly one action. We show that a strategy-improvement algorithm by by Björklund, Sandberg, and Vorobyov [3] can easily be adapted to the more general setting of ...
متن کاملA Discrete Stratety Improvement Algorithm for Solving Parity Games
A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus. Known strategy improvement algorithms, as proposed for stochastic games by Hoffman and Karp in 1966, and for discounted payoff games and parity games by Puri in 1995, work with real numbers and requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/070686652